0.08/0.13 % Problem : Vampire---4.8_4422 : TPTP v0.0.0. Released v0.0.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.36 % Computer : n015.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 1440 0.14/0.36 % WCLimit : 180 0.14/0.36 % DateTime : Mon Jul 3 13:05:55 EDT 2023 0.14/0.36 % CPUTime : 0.21/0.49 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.QTCWXfwi9t/Vampire---4.8_4422 0.21/0.49 # Version: 3.1pre001-ho 1.10/0.61 # Preprocessing class: HSSSSMSSSSSNSSA. 1.10/0.61 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.10/0.61 # Starting post_as_ho12 with 180s (1) cores 1.10/0.61 # Starting new_bool_9 with 180s (1) cores 1.10/0.61 # Starting post_as_ho1 with 180s (1) cores 1.10/0.61 # Starting post_as_ho4 with 180s (1) cores 1.10/0.61 # Starting post_as_ho2 with 180s (1) cores 1.10/0.61 # Starting ehoh_best2_full_lfho with 180s (1) cores 1.10/0.61 # Starting full_lambda_10 with 180s (1) cores 1.10/0.61 # Starting new_ho_8 with 180s (1) cores 1.10/0.61 # post_as_ho1 with pid 4603 completed with status 0 1.10/0.61 # Result found by post_as_ho1 1.10/0.61 # Preprocessing class: HSSSSMSSSSSNSSA. 1.10/0.61 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.10/0.61 # Starting post_as_ho12 with 180s (1) cores 1.10/0.61 # Starting new_bool_9 with 180s (1) cores 1.10/0.61 # Starting post_as_ho1 with 180s (1) cores 1.10/0.61 # No SInE strategy applied 1.10/0.61 # Search class: HGHSF-FFSF21-SSSFFMNN 1.10/0.61 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.10/0.61 # Starting post_as_ho5 with 98s (1) cores 1.10/0.61 # post_as_ho5 with pid 4614 completed with status 0 1.10/0.61 # Result found by post_as_ho5 1.10/0.61 # Preprocessing class: HSSSSMSSSSSNSSA. 1.10/0.61 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.10/0.61 # Starting post_as_ho12 with 180s (1) cores 1.10/0.61 # Starting new_bool_9 with 180s (1) cores 1.10/0.61 # Starting post_as_ho1 with 180s (1) cores 1.10/0.61 # No SInE strategy applied 1.10/0.61 # Search class: HGHSF-FFSF21-SSSFFMNN 1.10/0.61 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.10/0.61 # Starting post_as_ho5 with 98s (1) cores 1.10/0.61 # Preprocessing time : 0.001 s 1.10/0.61 # Presaturation interreduction done 1.10/0.61 1.10/0.61 # Proof found! 1.10/0.61 # SZS status Theorem 1.10/0.61 # SZS output start CNFRefutation 1.10/0.61 thf(decl_22, type, epred1_0: a > $o). 1.10/0.61 thf(decl_23, type, epred2_0: a > $o). 1.10/0.61 thf(decl_24, type, esk1_0: a > a). 1.10/0.61 thf(decl_25, type, esk2_1: a > a). 1.10/0.61 thf(decl_26, type, esk3_1: (a > a) > a). 1.10/0.61 thf(decl_27, type, esk4_2: (a > a) > a > a). 1.10/0.61 thf(decl_28, type, esk5_1: (a > a) > a). 1.10/0.61 thf(cEQP1_1B_pme, conjecture, ![X1:a > $o, X2:a > $o]:((?[X3:a > a]:((![X4:a]:((?[X5:a]:((((X2 @ X5)&((X4)=(X3 @ X5)))&![X6:a]:(((((X4)=(X3 @ X6))&(X2 @ X6))=>((X6)=(X5))))))<=(X1 @ X4)))&![X5:a]:(((X2 @ X5)=>(X1 @ (X3 @ X5))))))<=?[X3:a > a]:((![X5:a]:(((X1 @ X5)=>(X2 @ (X3 @ X5))))&![X4:a]:((?[X5:a]:((((X1 @ X5)&((X4)=(X3 @ X5)))&![X6:a]:((((X6)=(X5))<=(((X4)=(X3 @ X6))&(X1 @ X6))))))<=(X2 @ X4))))))), file('/export/starexec/sandbox2/tmp/tmp.QTCWXfwi9t/Vampire---4.8_4422', cEQP1_1B_pme)). 1.10/0.61 thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o]:((?[X3:a > a]:((![X5:a]:(((X1 @ X5)=>(X2 @ (X3 @ X5))))&![X4:a]:(((X2 @ X4)=>?[X5:a]:((((X1 @ X5)&((X4)=(X3 @ X5)))&![X6:a]:(((((X4)=(X3 @ X6))&(X1 @ X6))=>((X6)=(X5))))))))))=>?[X3:a > a]:((![X4:a]:(((X1 @ X4)=>?[X5:a]:((((X2 @ X5)&((X4)=(X3 @ X5)))&![X6:a]:(((((X4)=(X3 @ X6))&(X2 @ X6))=>((X6)=(X5))))))))&![X5:a]:(((X2 @ X5)=>(X1 @ (X3 @ X5))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEQP1_1B_pme])])). 1.10/0.61 thf(c_0_2, negated_conjecture, ![X22:a, X23:a, X25:a, X26:a > a, X28:a]:((((~(epred1_0 @ X22)|(epred2_0 @ (esk1_0 @ X22)))&((((epred1_0 @ (esk2_1 @ X23))|~(epred2_0 @ X23))&(((X23)=(esk1_0 @ (esk2_1 @ X23)))|~(epred2_0 @ X23)))&(((X23)!=(esk1_0 @ X25))|~(epred1_0 @ X25)|((X25)=(esk2_1 @ X23))|~(epred2_0 @ X23))))&((((epred2_0 @ (esk5_1 @ X26))|(epred1_0 @ (esk3_1 @ X26)))&(~(epred1_0 @ (X26 @ (esk5_1 @ X26)))|(epred1_0 @ (esk3_1 @ X26))))&(((((epred2_0 @ (esk5_1 @ X26))|(((esk3_1 @ X26)=(X26 @ (esk4_2 @ X26 @ X28)))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28)))))&(~(epred1_0 @ (X26 @ (esk5_1 @ X26)))|(((esk3_1 @ X26)=(X26 @ (esk4_2 @ X26 @ X28)))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28))))))&(((epred2_0 @ (esk5_1 @ X26))|((epred2_0 @ (esk4_2 @ X26 @ X28))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28)))))&(~(epred1_0 @ (X26 @ (esk5_1 @ X26)))|((epred2_0 @ (esk4_2 @ X26 @ X28))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28)))))))&(((epred2_0 @ (esk5_1 @ X26))|(((esk4_2 @ X26 @ X28)!=(X28))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28)))))&(~(epred1_0 @ (X26 @ (esk5_1 @ X26)))|(((esk4_2 @ X26 @ X28)!=(X28))|(~(epred2_0 @ X28)|((esk3_1 @ X26)!=(X26 @ X28)))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 1.10/0.61 thf(c_0_3, negated_conjecture, ![X3:a > a]:(((epred1_0 @ (esk3_1 @ X3))|~((epred1_0 @ (X3 @ (esk5_1 @ X3)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_4, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_1 @ X4))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_5, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk5_1 @ X3))|((esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ X4)))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_6, negated_conjecture, ![X4:a]:(((epred2_0 @ (esk1_0 @ X4))|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_7, negated_conjecture, ![X3:a > a]:(((epred1_0 @ (esk3_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0)))))|~((epred2_0 @ (X3 @ (esk5_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))))))))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 1.10/0.61 thf(c_0_8, negated_conjecture, ![X3:a > a]:(((epred2_0 @ (esk5_1 @ X3))|(epred1_0 @ (esk3_1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_9, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk5_1 @ X3))|(epred2_0 @ (esk4_2 @ X3 @ X4))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_10, negated_conjecture, ![X3:a > a, X4:a]:((((esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ (esk1_0 @ X4))))|(epred2_0 @ (esk5_1 @ X3))|((esk3_1 @ X3)!=(X3 @ (esk1_0 @ X4)))|~((epred1_0 @ X4)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 1.10/0.61 thf(c_0_11, negated_conjecture, (epred1_0 @ (esk3_1 @ esk2_1)), inference(spm,[status(thm)],[c_0_7, c_0_8])). 1.10/0.61 thf(c_0_12, negated_conjecture, ![X5:a, X4:a]:((((X5)=(esk2_1 @ X4))|((X4)!=(esk1_0 @ X5))|~((epred1_0 @ X5))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_13, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk4_2 @ X3 @ (esk1_0 @ X4)))|(epred2_0 @ (esk5_1 @ X3))|((esk3_1 @ X3)!=(X3 @ (esk1_0 @ X4)))|~((epred1_0 @ X4)))), inference(spm,[status(thm)],[c_0_9, c_0_6])). 1.10/0.61 thf(c_0_14, negated_conjecture, ![X3:a > a]:((((esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ (esk1_0 @ (esk3_1 @ esk2_1)))))|(epred2_0 @ (esk5_1 @ X3))|((esk3_1 @ X3)!=(X3 @ (esk1_0 @ (esk3_1 @ esk2_1)))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 1.10/0.61 thf(c_0_15, negated_conjecture, ![X4:a]:((((esk2_1 @ (esk1_0 @ X4))=(X4))|~((epred1_0 @ X4)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]), c_0_6])). 1.10/0.61 thf(c_0_16, negated_conjecture, ![X3:a > a]:(((epred2_0 @ (esk4_2 @ X3 @ (esk1_0 @ (esk3_1 @ esk2_1))))|(epred2_0 @ (esk5_1 @ X3))|((esk3_1 @ X3)!=(X3 @ (esk1_0 @ (esk3_1 @ esk2_1)))))), inference(spm,[status(thm)],[c_0_13, c_0_11])). 1.10/0.61 thf(c_0_17, negated_conjecture, ![X4:a]:((((X4)=(esk1_0 @ (esk2_1 @ X4)))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_18, negated_conjecture, (((esk2_1 @ (esk4_2 @ esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1))))=(esk3_1 @ esk2_1))|(epred2_0 @ (esk5_1 @ esk2_1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_11])])). 1.10/0.61 thf(c_0_19, negated_conjecture, ((epred2_0 @ (esk4_2 @ esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1))))|(epred2_0 @ (esk5_1 @ esk2_1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_15]), c_0_11])])). 1.10/0.61 thf(c_0_20, negated_conjecture, (((esk4_2 @ esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1)))=(esk1_0 @ (esk3_1 @ esk2_1)))|(epred2_0 @ (esk5_1 @ esk2_1))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])). 1.10/0.61 thf(c_0_21, negated_conjecture, ![X3:a > a, X4:a]:((((esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ X4)))|~((epred1_0 @ (X3 @ (esk5_1 @ X3))))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_22, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk5_1 @ X3))|((esk4_2 @ X3 @ X4)!=(X4))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_23, negated_conjecture, ((epred2_0 @ (esk1_0 @ (esk3_1 @ esk2_1)))|(epred2_0 @ (esk5_1 @ esk2_1))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 1.10/0.61 thf(c_0_24, negated_conjecture, (((esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1)))=(esk3_1 @ esk2_1))|(epred2_0 @ (esk5_1 @ esk2_1))), inference(spm,[status(thm)],[c_0_18, c_0_20])). 1.10/0.61 thf(c_0_25, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk4_2 @ X3 @ X4))|~((epred1_0 @ (X3 @ (esk5_1 @ X3))))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_26, negated_conjecture, ![X3:a > a, X4:a]:((~((epred1_0 @ (X3 @ (esk5_1 @ X3))))|((esk4_2 @ X3 @ X4)!=(X4))|~((epred2_0 @ X4))|((esk3_1 @ X3)!=(X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.10/0.61 thf(c_0_27, negated_conjecture, ![X3:a > a, X4:a]:((((esk3_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))))=(esk2_1 @ (X3 @ (esk4_2 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))) @ X4))))|((esk3_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))))!=(esk2_1 @ (X3 @ X4)))|~((epred2_0 @ (X3 @ (esk5_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0)))))))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_21, c_0_4])). 1.10/0.61 thf(c_0_28, negated_conjecture, (epred2_0 @ (esk5_1 @ esk2_1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_20]), c_0_23]), c_0_24])). 1.10/0.61 thf(c_0_29, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk4_2 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))) @ X4))|((esk3_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))))!=(esk2_1 @ (X3 @ X4)))|~((epred2_0 @ (X3 @ (esk5_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0)))))))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_25, c_0_4])). 1.10/0.61 thf(c_0_30, negated_conjecture, ![X3:a > a, X4:a]:((((esk3_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))))!=(esk2_1 @ (X3 @ X4)))|((esk4_2 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0))) @ X4)!=(X4))|~((epred2_0 @ (X3 @ (esk5_1 @ (^[Z0/* 25 */:a]:(esk2_1 @ (X3 @ Z0)))))))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_26, c_0_4])). 1.10/0.61 thf(c_0_31, negated_conjecture, ![X4:a]:((((esk2_1 @ (esk4_2 @ esk2_1 @ X4))=(esk3_1 @ esk2_1))|((esk3_1 @ esk2_1)!=(esk2_1 @ X4))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_27, c_0_28])). 1.10/0.61 thf(c_0_32, negated_conjecture, ![X4:a]:(((epred2_0 @ (esk4_2 @ esk2_1 @ X4))|((esk3_1 @ esk2_1)!=(esk2_1 @ X4))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_29, c_0_28])). 1.10/0.61 thf(c_0_33, negated_conjecture, ![X4:a]:((((esk3_1 @ esk2_1)!=(esk2_1 @ X4))|((esk4_2 @ esk2_1 @ X4)!=(X4))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_30, c_0_28])). 1.10/0.61 thf(c_0_34, negated_conjecture, ![X4:a]:((((esk1_0 @ (esk3_1 @ esk2_1))=(esk4_2 @ esk2_1 @ X4))|((esk3_1 @ esk2_1)!=(esk2_1 @ X4))|~((epred2_0 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_31]), c_0_32])). 1.10/0.61 thf(c_0_35, negated_conjecture, (((esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1)))!=(esk3_1 @ esk2_1))|~((epred2_0 @ (esk1_0 @ (esk3_1 @ esk2_1))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34])])). 1.10/0.61 thf(c_0_36, negated_conjecture, ~((epred2_0 @ (esk1_0 @ (esk3_1 @ esk2_1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_15]), c_0_11])])). 1.10/0.61 thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_6]), c_0_11])]), ['proof']). 1.10/0.61 # SZS output end CNFRefutation 1.10/0.61 # Parsed axioms : 2 1.10/0.61 # Removed by relevancy pruning/SinE : 0 1.10/0.61 # Initial clauses : 13 1.10/0.61 # Removed in clause preprocessing : 1 1.10/0.61 # Initial clauses in saturation : 12 1.10/0.61 # Processed clauses : 245 1.10/0.61 # ...of these trivial : 0 1.10/0.61 # ...subsumed : 26 1.10/0.61 # ...remaining for further processing : 219 1.10/0.61 # Other redundant clauses eliminated : 3 1.10/0.61 # Clauses deleted for lack of memory : 0 1.10/0.61 # Backward-subsumed : 3 1.10/0.61 # Backward-rewritten : 14 1.10/0.61 # Generated clauses : 839 1.10/0.61 # ...of the previous two non-redundant : 806 1.10/0.61 # ...aggressively subsumed : 0 1.10/0.61 # Contextual simplify-reflections : 6 1.10/0.61 # Paramodulations : 812 1.10/0.61 # Factorizations : 0 1.10/0.61 # NegExts : 2 1.10/0.61 # Equation resolutions : 4 1.10/0.61 # Total rewrite steps : 92 1.10/0.61 # Propositional unsat checks : 0 1.10/0.61 # Propositional check models : 0 1.10/0.61 # Propositional check unsatisfiable : 0 1.10/0.61 # Propositional clauses : 0 1.10/0.61 # Propositional clauses after purity: 0 1.10/0.61 # Propositional unsat core size : 0 1.10/0.61 # Propositional preprocessing time : 0.000 1.10/0.61 # Propositional encoding time : 0.000 1.10/0.61 # Propositional solver time : 0.000 1.10/0.61 # Success case prop preproc time : 0.000 1.10/0.61 # Success case prop encoding time : 0.000 1.10/0.61 # Success case prop solver time : 0.000 1.10/0.61 # Current number of processed clauses : 189 1.10/0.61 # Positive orientable unit clauses : 9 1.10/0.61 # Positive unorientable unit clauses: 0 1.10/0.61 # Negative unit clauses : 1 1.10/0.61 # Non-unit-clauses : 179 1.10/0.61 # Current number of unprocessed clauses: 555 1.10/0.61 # ...number of literals in the above : 3013 1.10/0.61 # Current number of archived formulas : 0 1.10/0.61 # Current number of archived clauses : 29 1.10/0.61 # Clause-clause subsumption calls (NU) : 3994 1.10/0.61 # Rec. Clause-clause subsumption calls : 713 1.10/0.61 # Non-unit clause-clause subsumptions : 34 1.10/0.61 # Unit Clause-clause subsumption calls : 104 1.10/0.61 # Rewrite failures with RHS unbound : 0 1.10/0.61 # BW rewrite match attempts : 71 1.10/0.61 # BW rewrite match successes : 3 1.10/0.61 # Condensation attempts : 0 1.10/0.61 # Condensation successes : 0 1.10/0.61 # Termbank termtop insertions : 318011 1.10/0.61 1.10/0.61 # ------------------------------------------------- 1.10/0.61 # User time : 0.113 s 1.10/0.61 # System time : 0.004 s 1.10/0.61 # Total time : 0.117 s 1.10/0.61 # Maximum resident set size: 1712 pages 1.10/0.62 1.10/0.62 # ------------------------------------------------- 1.10/0.62 # User time : 0.113 s 1.10/0.62 # System time : 0.007 s 1.10/0.62 # Total time : 0.120 s 1.10/0.62 # Maximum resident set size: 1724 pages 1.10/0.62 % E---3.1 exiting 1.10/0.62 EOF